A Characterisation of NL/poly via Nondeterministic Finite Automata
نویسندگان
چکیده
For each language L ⊆ 2 and non-zero monotonic function t ∶ N → N, we define a language t∗L ⊆ 2 depending only on L and t. We then prove that a language L lies in NL/poly if and only if there exists a polynomially bounded t (as above), such that the projections (t ∗L) ∩ 2 are accepted by nondeterministic finite automata of size polynomial in n. Therefore, proving super-polynomial lower bounds for unrestricted nondeterministic branching programs is equivalent to proving super-polynomial lower bounds for oblivious read-once nondeterministic branching programs i.e. nondeterministic finite automata.
منابع مشابه
Learning Regular Languages via Alternating Automata
Nearly all algorithms for learning an unknown regular language, in particular the popular L∗ algorithm, yield deterministic finite automata. It was recently shown that the ideas of L∗ can be extended to yield non-deterministic automata, and that the respective learning algorithm, NL∗, outperforms L∗ on randomly generated regular expressions. We conjectured that this is due to the existential na...
متن کاملAngluin-Style Learning of NFA
This paper introduces NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similar as in Angluin’s popular L algorithm, which however learns deterministic finite-state automata (DFA). As RFSA can be exponentially more succinct than DFA, RFSA are the preferable...
متن کاملNondeterminism is essential for reversal-bounded two-way multihead finite automata
It is proved for some "nice" function / that/(fl)-reversal-bounded two-way nondeterministic finite automata are more powerful than /(n)-reversal-bounded two-way deterministic ones. This solves a simplified extension of the well-known DLOG ? NLOG problem.
متن کاملOn Emptiness and Counting for Alternating Finite Automata
We investigate problems for regular languages coded by alternating nite automata. In automata and formal language theory, it is well-known that there is a language accepted by an n-state nondeterministic nite automaton but any deterministic nite automaton accepting that language must have at least 2 n states. Diierent representations of regular languages are used to deene problems of varying le...
متن کاملA Logical Characterization of Small 2NFAs
Let 2N be the class of families of problems solvable by families of two-way nondeterministic finite automata of polynomial size. We characterize 2N in terms of families of formulas of transitive-closure logic. These formulas apply the transitive-closure operator on a quantifier-free disjunctive normal form of first-order logic with successor and constants, where (i) apart from two special varia...
متن کامل